0.02/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.32	% Computer   : n012.cluster.edu
0.12/0.32	% Model      : x86_64 x86_64
0.12/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory     : 8042.1875MB
0.12/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 14:36:01 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.33	% Number of cores: 8
0.12/0.33	% Python version: Python 3.6.8
0.12/0.33	# Version: 2.6rc1-ho
0.18/0.34	# No SInE strategy applied
0.18/0.34	# Trying AutoSched0 for 59 seconds
0.18/0.45	# AutoSched0-Mode selected heuristic G_E___208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.18/0.45	# and selection function SelectComplexExceptUniqMaxHorn.
0.18/0.45	#
0.18/0.45	# Preprocessing time       : 0.097 s
0.18/0.45	# Presaturation interreduction done
0.18/0.45	
0.18/0.45	# Proof found!
0.18/0.45	# SZS status Theorem
0.18/0.45	# SZS output start CNFRefutation
0.18/0.45	thf(fact_192_singleton__conv, axiom, ![X2:$o]:(collect_o @ (^[X11:$o]:(X11<=>X2)))=(insert_o @ (X2) @ bot_bot_set_o), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_192_singleton__conv)).
0.18/0.45	thf(fact_240_insert__Collect, axiom, ![X2:$o, X10:$o > $o]:(insert_o @ (X2) @ (collect_o @ X10))=(collect_o @ (^[X525:$o]:((X525<~>X2)=>X10 @ (X525)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_240_insert__Collect)).
0.18/0.45	thf(fact_6__092_060open_062_092_060lbrakk_062p_A_061_Ap_059_Alast_Aexec_H_A_092_060turnstile_062_Amsg_A_092_060mapsto_062_AcMsg_059_AisReceiverOf_Ap_Amsg_059_AinitReachable_A_Ilast_Aexec_H_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Aval_091p_Mlast_Aexec_H_093_A_092_060subseteq_062_Aval_091p_McMsg_093_092_060close_062, axiom, ((p2)=(p2)=>(steps_p_s_v @ trans @ sends @ (last_c571238084t_unit @ exec2) @ msg @ cMsg=>(isReceiverOf_p_v @ p2 @ msg=>(initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2)=>ord_less_eq_set_o @ (collect_o @ (^[X60:$o]:pSilDecVal_p_s_v @ trans @ sends @ start @ (X60) @ p2 @ (last_c571238084t_unit @ exec2))) @ (collect_o @ (^[X60:$o]:pSilDecVal_p_s_v @ trans @ sends @ start @ (X60) @ p2 @ cMsg)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_6__092_060open_062_092_060lbrakk_062p_A_061_Ap_059_Alast_Aexec_H_A_092_060turnstile_062_Amsg_A_092_060mapsto_062_AcMsg_059_AisReceiverOf_Ap_Amsg_059_AinitReachable_A_Ilast_Aexec_H_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Aval_091p_Mlast_Aexec_H_093_A_092_060subseteq_062_Aval_091p_McMsg_093_092_060close_062)).
0.18/0.45	thf(conj_0, conjecture, ord_less_eq_set_o @ (collect_o @ (^[X60:$o]:pSilDecVal_p_s_v @ trans @ sends @ start @ (X60) @ p2 @ (last_c571238084t_unit @ exec2))) @ (collect_o @ (^[X60:$o]:pSilDecVal_p_s_v @ trans @ sends @ start @ (X60) @ p2 @ cMsg)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.18/0.45	thf(fact_158_C_H_I2_J, axiom, (collect_o @ (^[X60:$o]:pSilDecVal_p_s_v @ trans @ sends @ start @ (X60) @ p2 @ c))=(insert_o @ ($true) @ (insert_o @ (~$true) @ bot_bot_set_o)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_158_C_H_I2_J)).
0.18/0.45	thf(fact_14_nonUniformC_H, axiom, ((~(vUniform_p_s_v @ trans @ sends @ start @ ($true) @ (last_c571238084t_unit @ exec2))&~(vUniform_p_s_v @ trans @ sends @ start @ (~$true) @ (last_c571238084t_unit @ exec2)))&initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_14_nonUniformC_H)).
0.18/0.45	thf(fact_2_NewExec_I3_J, axiom, (last_c571238084t_unit @ exec2)=(c), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2_NewExec_I3_J)).
0.18/0.45	thf(fact_3_CMsg, axiom, steps_p_s_v @ trans @ sends @ (last_c571238084t_unit @ exec2) @ msg @ cMsg, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_CMsg)).
0.18/0.45	thf(fact_0_PisReceiverOf, axiom, isReceiverOf_p_v @ p2 @ msg, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_PisReceiverOf)).
0.18/0.45	thf(c_0_9, plain, ![X11:$o, X2:$o]:(epred6_2 @ X2 @ X11<=>(X11<=>X2)), introduced(definition)).
0.18/0.45	thf(c_0_10, plain, ![X525:$o, X2:$o, X10:$o > $o]:(epred15_3 @ X10 @ X2 @ X525<=>(~((X525<=>X2))=>((~X525|X10 @ $true)&(X525|X10 @ $false)))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[introduced(definition)])])).
0.18/0.45	thf(c_0_11, plain, ![X60:$o, X19:p > s > messageValue_v > s, X20:p > s > messageValue_v > message_p_v > nat, X21:p > s, X57:p, X59:config256849571t_unit]:(epred4_6 @ X59 @ X57 @ X21 @ X20 @ X19 @ X60<=>((~X60|pSilDecVal_p_s_v @ X19 @ X20 @ X21 @ $true @ X57 @ X59)&(X60|pSilDecVal_p_s_v @ X19 @ X20 @ X21 @ $false @ X57 @ X59))), inference(fool_unroll,[status(thm)],[introduced(definition)])).
0.18/0.45	thf(c_0_12, axiom, ![X2:$o]:((~X2|(collect_o @ (epred6_2 @ X2))=(insert_o @ $true @ bot_bot_set_o))&(X2|(collect_o @ (epred6_2 @ X2))=(insert_o @ $false @ bot_bot_set_o))), inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[fact_192_singleton__conv, c_0_9])])).
0.18/0.45	thf(c_0_13, axiom, ![X2:$o, X10:$o > $o]:((~X2|(insert_o @ $true @ (collect_o @ X10))=(collect_o @ (epred15_3 @ X10 @ X2)))&(X2|(insert_o @ $false @ (collect_o @ X10))=(collect_o @ (epred15_3 @ X10 @ X2)))), inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[fact_240_insert__Collect, c_0_10])])).
0.18/0.45	thf(c_0_14, axiom, ((p2)=(p2)=>(steps_p_s_v @ trans @ sends @ (last_c571238084t_unit @ exec2) @ msg @ cMsg=>(isReceiverOf_p_v @ p2 @ msg=>(initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2)=>ord_less_eq_set_o @ (collect_o @ (epred4_6 @ (last_c571238084t_unit @ exec2) @ p2 @ start @ sends @ trans)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[fact_6__092_060open_062_092_060lbrakk_062p_A_061_Ap_059_Alast_Aexec_H_A_092_060turnstile_062_Amsg_A_092_060mapsto_062_AcMsg_059_AisReceiverOf_Ap_Amsg_059_AinitReachable_A_Ilast_Aexec_H_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Aval_091p_Mlast_Aexec_H_093_A_092_060subseteq_062_Aval_091p_McMsg_093_092_060close_062, c_0_11]), c_0_11])).
0.18/0.45	thf(c_0_15, negated_conjecture, ~ord_less_eq_set_o @ (collect_o @ (epred4_6 @ (last_c571238084t_unit @ exec2) @ p2 @ start @ sends @ trans)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans)), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0]), c_0_11]), c_0_11])])).
0.18/0.45	thf(c_0_16, plain, (collect_o @ (epred4_6 @ c @ p2 @ start @ sends @ trans))=(insert_o @ $true @ (insert_o @ $false @ bot_bot_set_o)), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[fact_158_C_H_I2_J, c_0_11])])])).
0.18/0.45	thf(c_0_17, plain, ![X1808:$o]:((~X1808|(collect_o @ (epred6_2 @ X1808))=(insert_o @ $true @ bot_bot_set_o))&(X1808|(collect_o @ (epred6_2 @ X1808))=(insert_o @ $false @ bot_bot_set_o))), inference(variable_rename,[status(thm)],[c_0_12])).
0.18/0.45	thf(c_0_18, plain, ![X2607:$o, X2608:$o > $o]:((~X2607|(insert_o @ $true @ (collect_o @ X2608))=(collect_o @ (epred15_3 @ X2608 @ X2607)))&(X2607|(insert_o @ $false @ (collect_o @ X2608))=(collect_o @ (epred15_3 @ X2608 @ X2607)))), inference(variable_rename,[status(thm)],[c_0_13])).
0.18/0.45	thf(c_0_19, plain, ((p2)!=(p2)|(~steps_p_s_v @ trans @ sends @ (last_c571238084t_unit @ exec2) @ msg @ cMsg|(~isReceiverOf_p_v @ p2 @ msg|(~initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2)|ord_less_eq_set_o @ (collect_o @ (epred4_6 @ (last_c571238084t_unit @ exec2) @ p2 @ start @ sends @ trans)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans)))))), inference(fof_nnf,[status(thm)],[c_0_14])).
0.18/0.45	thf(c_0_20, plain, ((~vUniform_p_s_v @ trans @ sends @ start @ $true @ (last_c571238084t_unit @ exec2)&~vUniform_p_s_v @ trans @ sends @ start @ $false @ (last_c571238084t_unit @ exec2))&initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2)), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[fact_14_nonUniformC_H])])).
0.18/0.45	thf(c_0_21, negated_conjecture, ~ord_less_eq_set_o @ (collect_o @ (epred4_6 @ (last_c571238084t_unit @ exec2) @ p2 @ start @ sends @ trans)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.18/0.45	thf(c_0_22, plain, (last_c571238084t_unit @ exec2)=(c), inference(split_conjunct,[status(thm)],[fact_2_NewExec_I3_J])).
0.18/0.45	thf(c_0_23, plain, (collect_o @ (epred4_6 @ c @ p2 @ start @ sends @ trans))=(insert_o @ $true @ (insert_o @ $false @ bot_bot_set_o)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.18/0.45	thf(c_0_24, plain, (collect_o @ (epred6_2 @ $false))=(insert_o @ $false @ bot_bot_set_o), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_17])])])).
0.18/0.45	thf(c_0_25, plain, ![X10:$o > $o]:(insert_o @ $true @ (collect_o @ X10))=(collect_o @ (epred15_3 @ X10 @ $true)), inference(eliminate_boolean_vars,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_18])])])).
0.18/0.45	thf(c_0_26, plain, (ord_less_eq_set_o @ (collect_o @ (epred4_6 @ (last_c571238084t_unit @ exec2) @ p2 @ start @ sends @ trans)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans))|(p2)!=(p2)|~steps_p_s_v @ trans @ sends @ (last_c571238084t_unit @ exec2) @ msg @ cMsg|~isReceiverOf_p_v @ p2 @ msg|~initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.18/0.45	thf(c_0_27, plain, initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2), inference(split_conjunct,[status(thm)],[c_0_20])).
0.18/0.45	thf(c_0_28, plain, steps_p_s_v @ trans @ sends @ (last_c571238084t_unit @ exec2) @ msg @ cMsg, inference(split_conjunct,[status(thm)],[fact_3_CMsg])).
0.18/0.45	thf(c_0_29, negated_conjecture, ~ord_less_eq_set_o @ (collect_o @ (epred4_6 @ c @ p2 @ start @ sends @ trans)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans)), inference(rw,[status(thm)],[c_0_21, c_0_22])).
0.18/0.45	thf(c_0_30, plain, (collect_o @ (epred4_6 @ c @ p2 @ start @ sends @ trans))=(collect_o @ (epred15_3 @ (epred6_2 @ $false) @ $true)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24]), c_0_25])).
0.18/0.45	thf(c_0_31, plain, (ord_less_eq_set_o @ (collect_o @ (epred4_6 @ (last_c571238084t_unit @ exec2) @ p2 @ start @ sends @ trans)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans))|~isReceiverOf_p_v @ p2 @ msg|~initReachable_p_s_v @ trans @ sends @ start @ (last_c571238084t_unit @ exec2)|~steps_p_s_v @ trans @ sends @ (last_c571238084t_unit @ exec2) @ msg @ cMsg), inference(cn,[status(thm)],[c_0_26])).
0.18/0.45	thf(c_0_32, plain, isReceiverOf_p_v @ p2 @ msg, inference(split_conjunct,[status(thm)],[fact_0_PisReceiverOf])).
0.18/0.45	thf(c_0_33, plain, initReachable_p_s_v @ trans @ sends @ start @ c, inference(rw,[status(thm)],[c_0_27, c_0_22])).
0.18/0.45	thf(c_0_34, plain, steps_p_s_v @ trans @ sends @ c @ msg @ cMsg, inference(rw,[status(thm)],[c_0_28, c_0_22])).
0.18/0.45	thf(c_0_35, negated_conjecture, ~ord_less_eq_set_o @ (collect_o @ (epred15_3 @ (epred6_2 @ $false) @ $true)) @ (collect_o @ (epred4_6 @ cMsg @ p2 @ start @ sends @ trans)), inference(rw,[status(thm)],[c_0_29, c_0_30])).
0.18/0.45	thf(c_0_36, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_22]), c_0_30]), c_0_32]), c_0_22]), c_0_33]), c_0_22]), c_0_34])]), c_0_35]), ['proof']).
0.18/0.45	# SZS output end CNFRefutation
0.18/0.45	# Proof object total steps             : 37
0.18/0.45	# Proof object clause steps            : 16
0.18/0.45	# Proof object formula steps           : 21
0.18/0.45	# Proof object conjectures             : 5
0.18/0.45	# Proof object clause conjectures      : 3
0.18/0.45	# Proof object formula conjectures     : 2
0.18/0.45	# Proof object initial clauses used    : 9
0.18/0.45	# Proof object initial formulas used   : 9
0.18/0.45	# Proof object generating inferences   : 0
0.18/0.45	# Proof object simplifying inferences  : 18
0.18/0.45	# Training examples: 0 positive, 0 negative
0.18/0.45	# Parsed axioms                        : 424
0.18/0.45	# Removed by relevancy pruning/SinE    : 0
0.18/0.45	# Initial clauses                      : 2001
0.18/0.45	# Removed in clause preprocessing      : 760
0.18/0.45	# Initial clauses in saturation        : 1241
0.18/0.45	# Processed clauses                    : 464
0.18/0.45	# ...of these trivial                  : 19
0.18/0.45	# ...subsumed                          : 106
0.18/0.45	# ...remaining for further processing  : 338
0.18/0.45	# Other redundant clauses eliminated   : 59
0.18/0.45	# Clauses deleted for lack of memory   : 0
0.18/0.45	# Backward-subsumed                    : 0
0.18/0.45	# Backward-rewritten                   : 5
0.18/0.45	# Generated clauses                    : 59
0.18/0.45	# ...of the previous two non-trivial   : 19
0.18/0.45	# Contextual simplify-reflections      : 0
0.18/0.45	# Paramodulations                      : 0
0.18/0.45	# Factorizations                       : 0
0.18/0.45	# NegExts                              : 0
0.18/0.45	# Equation resolutions                 : 59
0.18/0.45	# Propositional unsat checks           : 0
0.18/0.45	#    Propositional check models        : 0
0.18/0.45	#    Propositional check unsatisfiable : 0
0.18/0.45	#    Propositional clauses             : 0
0.18/0.45	#    Propositional clauses after purity: 0
0.18/0.45	#    Propositional unsat core size     : 0
0.18/0.45	#    Propositional preprocessing time  : 0.000
0.18/0.45	#    Propositional encoding time       : 0.000
0.18/0.45	#    Propositional solver time         : 0.000
0.18/0.45	#    Success case prop preproc time    : 0.000
0.18/0.45	#    Success case prop encoding time   : 0.000
0.18/0.45	#    Success case prop solver time     : 0.000
0.18/0.45	# Current number of processed clauses  : 274
0.18/0.45	#    Positive orientable unit clauses  : 90
0.18/0.45	#    Positive unorientable unit clauses: 0
0.18/0.45	#    Negative unit clauses             : 49
0.18/0.45	#    Non-unit-clauses                  : 135
0.18/0.45	# Current number of unprocessed clauses: 796
0.18/0.45	# ...number of literals in the above   : 2747
0.18/0.45	# Current number of archived formulas  : 0
0.18/0.45	# Current number of archived clauses   : 5
0.18/0.45	# Clause-clause subsumption calls (NU) : 3580
0.18/0.45	# Rec. Clause-clause subsumption calls : 3011
0.18/0.45	# Non-unit clause-clause subsumptions  : 60
0.18/0.45	# Unit Clause-clause subsumption calls : 395
0.18/0.45	# Rewrite failures with RHS unbound    : 0
0.18/0.45	# BW rewrite match attempts            : 22
0.18/0.45	# BW rewrite match successes           : 5
0.18/0.45	# Condensation attempts                : 0
0.18/0.45	# Condensation successes               : 0
0.18/0.45	# Termbank termtop insertions          : 107478
0.18/0.45	
0.18/0.45	# -------------------------------------------------
0.18/0.45	# User time                : 0.115 s
0.18/0.45	# System time              : 0.010 s
0.18/0.45	# Total time               : 0.126 s
0.18/0.45	# Maximum resident set size: 2556 pages
0.18/0.46	EOF